On the S-Lemma for Univariate Polynomials

نویسندگان

  • Simai HE
  • Shuzhong ZHANG
چکیده

The so-called S-lemma has played an important role in optimization, both in theory and in applications. The significance of S-lemma is especially pronounced in control theory, robust optimization, and non-convex quadratic optimization. Hitherto, S-lemma is however established only in the domain of quadratic functions. In this paper we shall extend the notion of S-lemma to the class of univariate polynomials of any degree. The applications of the new S-lemma will be discussed as well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Matrix-Valued Riesz Lemma and Local Orthonormal Bases in Shift-Invariant Spaces

We use the matrix-valued Fejér–Riesz lemma for Laurent polynomials to characterize when a univariate shift-invariant space has a local orthonormal shift-invariant basis, and we apply the above characterization to study local dual frame generators, local orthonormal bases of wavelet spaces, and MRA-based affine frames. Also we provide a proof of the matrixvalued Fejér–Riesz lemma for Laurent pol...

متن کامل

A Hitting Set Construction, with Applications to Arithmetic Circuit Lower Bounds

A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form Pt j=0 cjX αj (a+ bX)j . From our algorithm we derive an exponential lower bound for representations of polynomials such as

متن کامل

Fuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma

The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.

متن کامل

A numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems

In this paper‎, two inverse problems of determining an unknown source term in a parabolic‎ equation are considered‎. ‎First‎, ‎the unknown source term is ‎estimated in the form of a combination of Chebyshev functions‎. ‎Then‎, ‎a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem‎. ‎For solving the problem‎, ‎the operational matrices of int...

متن کامل

On interpolation by radial polynomials

A lemma of Micchelli’s, concerning radial polynomials and weighted sums of point evaluations, is shown to hold for arbitrary linear functionals, as is Schaback’s more recent extension of this lemma and Schaback’s result concerning interpolation by radial polynomials. Schaback’s interpolant is explored. In his most-cited paper, [M], Micchelli supplies the following interesting auxiliary lemma (h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012